Efficient Representation and Computation of Reachable Sets for Hybrid Systems

نویسندگان

  • Olaf Stursberg
  • Bruce H. Krogh
چکیده

Computing reachable sets is an essential step in most analysis and synthesis techniques for hybrid systems. The representation of these sets has a deciding impact on the computational complexity and thus the applicability of these techniques. This paper presents a new approach for approximating reachable sets using oriented rectangular hulls (ORHs), the orientations of which are determined by singular value decompositions of sample covariance matrices for sets of reachable states. The orientations keep the over-approximation of the reachable sets small in most cases with a complexity of low polynomial order with respect to the dimension of the continuous state space. We show how the use of ORHs can improve the efficiency of reachable set computation significantly for hybrid systems with nonlinear continuous dynamics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Reachable Sets of Hybrid Systems Using a Combination of Zonotopes and Polytopes

The computation of reachable sets for hybrid systems with linear continuous dynamics is addressed. Zonotopes are used for the representation of reachable sets, resulting in an algorithm with low computational complexity with respect to the dimension of the considered system. However, zonotopes have drawbacks when being intersected with transition guards which determine the discrete behavior of ...

متن کامل

An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems

This paper addresses the exact computation of the set of reachable states of a strongly linear hybrid system. It proposes an approach that is an extension of classical state-space exploration. This approach uses a new operation, based on a cycle analysis in the control graph of the system, for generating sets of reachable states, as well as a powerful representation system for sets of values. T...

متن کامل

Efficient Computation of Reachable Sets of Linear Time-Invariant Systems with Inputs

This work is concerned with the problem of computing the set of reachable states for linear time-invariant systems with bounded inputs. Our main contribution is a novel algorithm which improves significantly the computational complexity of reachability analysis. Algorithms to compute over and under-approximations of the reachable sets are proposed as well. These algorithms are not subject to th...

متن کامل

An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract)

This paper addresses the exact computation of the set of reachable states of a strongly linear hybrid system. It proposes an approach that is an extension of classical state-space exploration. This approach uses a new operation, based on a cycle analysis in the control graph of the system, for generating sets of reachable states, as well as a powerful representation system for sets of values. T...

متن کامل

Verification of Uncertain Embedded Systems by Computing Reachable Sets Based on Zonotopes

Formal verification using reachability analysis has been shown to be useful for detecting design failures for controlled embedded systems, and thus to improve dependability. If the state space is hybrid, however, the growth of complexity with the dimension of the continuous dynamics limits the applicability significantly. This paper proposes an efficient approach to computing reachable sets for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003